On a Covering Problem for Equilateral Triangles
نویسندگان
چکیده
Let T be a unit equilateral triangle, and T1, . . . , Tn be n equilateral triangles that cover T and satisfy the following two conditions: (i) Ti has side length ti (0 < ti < 1); (ii) Ti is placed with each side parallel to a side of T . We prove a conjecture of Zhang and Fan asserting that any covering that meets the above two conditions (i) and (ii) satisfies ∑n i=1 ti ≥ 2. We also show that this bound cannot be improved.
منابع مشابه
Packing and Covering a Unit Equilateral Triangle with Equilateral Triangles
Packing and covering are elementary but very important in combinatorial geometry , they have great practical and theoretical significance. In this paper, we discuss a problem on packing and covering a unit equilateral triangle with smaller triangles which is originated from one of Erd˝ os' favorite problems.
متن کاملTranslative Packing of Unit Squares into Equilateral Triangles
Every collection of n (arbitrary-oriented) unit squares can be packed translatively into any equilateral triangle of side length 2.3755 ̈ ? n. Let the coordinate system in the Euclidean plane be given. For 0 ≤ αi ă π{2, denote by Spαiq a square in the plane with sides of unit length and with an angle between the x-axis and a side of Spαiq equal to αi. Furthermore, let T psq be an equilateral tr...
متن کاملUnderstanding the Eigenstructure of Various Triangles
We examine the eigenstructure of generalized isosceles triangles and explore the possibilities of analytic solutions to the general eigenvalue problem in other triangles. Starting with work based off of Brian McCartin’s paper on equilateral triangles, we first explore the existence of analytic solutions within the space of all isosceles triangles. We find that this method only leads to consiste...
متن کاملCovering Folded Shapes
Can folding a piece of paper flat make it larger? We explore whether a shape S must be scaled to cover a flat-folded copy of itself. We consider both single folds and arbitrary folds (continuous piecewise isometries S → R2). The underlying problem is motivated by computational origami, and is related to other covering and fixturing problems, such as Lebesgue’s universal cover problem and force ...
متن کاملOnline Packing of Equilateral Triangles
We investigate the online triangle packing problem in which a sequence of equilateral triangles with different sizes appear in an online, sequential manner. The goal is to place these triangles into a minimum number of squares of unit size. We provide upper and lower bounds for the competitive ratio of online algorithms. In particular, we introduce an algorithm which achieves a competitive rati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 15 شماره
صفحات -
تاریخ انتشار 2008